Semi-greedy heuristics for feature selection with test cost constraints
نویسندگان
چکیده
منابع مشابه
Semi-greedy heuristics for feature selection with test cost constraints
In real-world applications, the test cost of data collection should not exceed a given budget. The problem of selecting an informative feature subset under this budget is referred to as feature selection with test cost constraints. Greedy heuristics are a natural and efficient method for this kind of combinatorial optimization problem. However, the recursive selection of locally optimal choices...
متن کاملFeature selection with test cost constraint
Feature selection is an important preprocessing step in machine learning and data mining. In real-world applications, costs, including money, time and other resources, are required to acquire the features. In some cases, there is a test cost constraint due to limited resources. We shall deliberately select an informative and cheap feature subset for classification. This paper proposes the featu...
متن کاملGreedy Heuristics for Degenerate Primer Selection
Amplification of multiple DNA sequences in a single Polymerase Chain Reaction (PCR) experiment, called Multiplex PCR (MPPCR), is a widely known laboratory technique that requires efficient selection of a set of synthetic strings called Degenerate Primers to result in successful PCR products. The Multiple Degenerate Primer Selection Problem (MDPSP) is a fundamental problem in molecular biology a...
متن کاملGreedy Feature Selection for Subspace Clustering Greedy Feature Selection for Subspace Clustering
Unions of subspaces provide a powerful generalization of single subspace models for collections of high-dimensional data; however, learning multiple subspaces from data is challenging due to the fact that segmentation—the identification of points that live in the same subspace—and subspace estimation must be performed simultaneously. Recently, sparse recovery methods were shown to provide a pro...
متن کاملMinimal Test Cost Feature Selection with Positive Region Constraint
Test cost is often required to obtain feature values of an object. When this issue is involved, people are often interested in schemes minimizing it. In many data mining applications, due to economic, technological and legal reasons, it is neither possible nor necessary to obtain a classifier with 100% accuracy. There may be an industrial standard to indicate the accuracy of the classification....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Granular Computing
سال: 2016
ISSN: 2364-4966,2364-4974
DOI: 10.1007/s41066-016-0017-2